This mandatory course is aimed at providing a comprehensive overview of the different facets of Cyber Security.  In addition, the course will detail into specifics of Cyber Security with Cyber Laws both in Global and Indian Legal environments

Security Fundamentals-4 As Architecture Authentication Authorization Accountability, Social Media, Social Networking and Cyber Security.Cyber Laws, IT Act 2000-IT Act 2008-Laws for Cyber-Security, Comprehensive National Cyber-Security Initiative CNCI – Legalities

Cyber Attack and Cyber Services Computer Virus – Computer Worms – Trojan horse.Vulnerabilities -  Phishing -  Online Attacks – Pharming - Phoarging  –  Cyber Attacks  -  Cyber Threats -  Zombie- stuxnet - Denial of Service Vulnerabilities  - Server Hardening-TCP/IP attack-SYN Flood

Cyber Security Management Risk Management and Assessment - Risk Management Process - Threat Determination Process -Risk Assessment - Risk Management Lifecycle.Security Policy Management - Security Policies - Coverage Matrix Business Continuity Planning - DisasterTypes  -  Disaster Recovery Plan - Business Continuity Planning Process

Vulnerability - Assessment and Tools: Vulnerability Testing - Penetration Testing Black box- white box.Architectural Integration:  Security Zones - Devicesviz Routers, Firewalls, DMZ. Configuration Management - Certification and Accreditation for Cyber-Security.

Authentication and Cryptography: Authentication - Cryptosystems - Certificate Services, Securing Communications:  Securing Services -  Transport  –  Wireless  -  Steganography and NTFS Data Streams. Intrusion Detection and Prevention Systems:   Intrusion -  Defense in Depth  -  IDS/IPS  -IDS/IPS Weakness and Forensic AnalysisCyber Evolution: Cyber Organization – Cyber Future

R2. Thomas R, Justin Peltier, John, “Information Security Fundamentals”, Auerbach Publications.

R3. AtulKahate, “Cryptography and Network Security”,  2^nd Edition, Tata McGrawHill.2003

R4. Nina Godbole, SunitBelapure, “Cyber Security”, Wiley India 1^st Edition 2011

R5. Jennifer L. Bayuk and Jason Healey and Paul Rohmeyer and Marcus Sachs, “Cyber Security Policy Guidebook”, Wiley; 1 edition , 2012

R6. Dan Shoemaker and Wm. Arthur Conklin, “Cyber security: The Essential Body Of Knowledge”,   Delmar Cengage Learning; 1 edition, 2011

R7. Stallings, “Cryptography & Network Security - Principles & Practice”, Prentice Hall, 6th Edition 2014

Maximum Marks : 50

The aim of this course is to familiarize the student with the principle of operation, capabilities and limitation of various electron devices so that he or she will be able to use these devices effectively.

1. DC Biasing - BJTs : Operating Point, Transistor Biasing circuits (Fixed Bias, Emitter Bias, Voltage Divider Bias, DC Bias with voltage feedback. Transistor as a switch.

2. BJT AC Analysis: BJT as amplifier. Small signal equivalent circuits (Low frequency re and h models only). Small signal analysis of CE, CB, CC (Voltage Divider Bias) configurations using re and hybrid  model – with and without bypass capacitor.

1. JFET: Construction, Operation, Characteristic, Shockley's Equation, Transfer Characteristics and Applications, MOSFET :Enhancement type MOSFET and Depletion MOSFET – Construction, Operation and Characteristics, Handling precautions for MOSFET 

2. FET Biasing: Fixed Bias Configuration, Self – Bias Configuration, Voltage Divider Biasing. Depletion Type MOSFETs, Enhancement Type MOSFETs, FET Amplifiers: FET Small Signal Model  

1. General shape of frequency response of amplifiers. Definition of bel, decibel, cut off frequencies and bandwidth. Low frequency analysis of amplifiers to obtain lower cut off frequency.

2. Hybrid – pi equivalent circuit of BJTs. High frequency analysis of BJT amplifiers to obtain upper cut off frequency

Feedback Amplifiers: Negative and positive feedback. Properties of negative  and positive feedback, negative feedback configurations, analysis of negative feedback amplifiers for gain, frequency response, input impedance, and output impedance of different configurations (voltage series, current series, voltage shunt, and current shunt)

CASCADE SYSTEMS: Analysis of frequency response and gain for BJT and FET amplifiers

POWER CONTROL DEVICES: Power control devices: PNPN diode (Shockley diode)  SCR characteristics – LASCR (Light Activated SCR) – TRIAC – DIAC – Structure & Characteristics. Characteristics and equivalent circuit of UJT - intrinsic stand-off ratio

T2. Jacob Millman & Christos C. Halkias, “Electronic Devices and Circuits”, Tata McGraw-Hill Education Pvt. Ltd., 2010.

R2. Donald A Neamen, “Electronic Circuit Analysis and Design”, 3/e, TMH.

R3. Albert Paul Malvino, Electronic Principles, 8th Ed, McGraw-Hill Education, 2016.

R4. Sedra and Smith.” Microelectronic Circuits”, 6/e, Oxford University Press, 2010.

R5. David A. Bell, “Electronic Devices and Circuits”, 4th Edition, Prentice Hall of India, 2007.  

CIA I   :  Subject Assignments / Online Tests                       : 10 marks

CIA II  :   Mid Semester Examination (Theory)                      : 25 marks                  

CIAIII:Quiz/Seminar/Case Studies/Project/Innovative Assignments/presentations/publications                                : 10 marks

Attendance                                                                             : 05 marks

            Total                                                                                       : 50 marks

Mid Semester Examination (MSE) : Theory Papers:

• The MSE is conducted for 50 marks of 2 hours duration.
• Question paper pattern; Five out of Six questions have to be answered. Each  question carries 10 marks

End Semester Examination (ESE):

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers are divided into FIVE units and each unit carries equal Weightage in terms of marks distribution.

Identify, formulate, research literature, and analyse complex engineering

problems reaching substantiated conclusions using first principles of mathematics, natural

sciences, and engineering sciences.

Divisibility and the divisibility algorithm, Euclidean algorithm, Modular arithmetic, Groups, Rings and Fields, Finite fields of the form GF(p), Polynomial arithmetic, Finite fields of the form GF(2n), Galois group of a field extensions, Fixed field and Galois extensions, Fundamental theorem of Galois Theory

Symmetric cipher model, Substitution techniques, Transposition techniques, Steganography, Traditional Block Cipher structure, Data Encryption Standard (DES) 

The AES Cipher, Linear Congruential Generators, Linear Feedback Shift Registers, Design and analysis of stream ciphers, Stream ciphers using LFSRs 

ESE-50

The course will lay down the basic concepts and techniques of linear algebra, differential equation, Analytical optimization and graph theory as applied to intelligent system design.

Introduction, Gaussian Elimination ( for solutions and Inverse, Nonsingular versus Singular) ,Determinants and Properties of the Determinant.

Vector Spaces (column, Row Null and left nullspace), Linear Independence, Basis and Dimension, Linear Transformations, Eigenvalues and Eigenvectors, Diagonalization of a Matrix, Positive Semi definite and Positive Definite.

Partial derivatives,Taylors Series and Linearization, Gradient, directional derivative. Vector and matrix calculus, Calculus: Convexity and concavity of functions of one and two variables, local/global maxima and minima, saddle point

Principles of Probablity Theory( Expectation, Variance, density , Bayes theorem, Central limit Theory), Standard Distributions (Binomial, Poisson, Normal, Chi-squared,t-distribution) , Maximum Likelyhood Theory, Statistical Tests(type I, Type II error, T-test, Chi-squared Test), Confidence Intervals

Objective function, Constraints; Formulation of simple design problems as mathematical programming problems. Classification of optimization problems, Optimization with linear constraint using  Lagrangian function, Standard form of linear programming (LP) problem- Graphical method, Steepest descent method, Newtons Method, Convex optimization.

Graph Theory: Graph Terminology and Special Types of Graphs, Planar Graphs, Graph Coloring, Trees, Graph Minor. Vertex cover, matching, path cover, connectivity, edge coloring, vertex coloring, list coloring; Planarity, Perfect graphs; other special classes of Graphs Connectivity, Hamilton Paths-Travelling salesman problem . Shortest path algorithm-Dijkstra’s algorithm

T2.  MP Deisenroth, A A Faisal, C S Ong, Mathematics for Machine learning, Cambridge University, 2020

T3.  Phil Dyke, Advanced Calculus, Macmillan International Higher Education, 1998

T4.  Fletcher R., Practical Methods of Optimization, John Wiley, 2000

T5.  Reinhard Diestel, "Graph Theory", Springer (2010)

R2.  Jorge Nocedal and Stephen J. Wright: "Numerical Optimization", second ed,1999

·         End Semester Examination(ESE)            : 50% (50 marks out of 100 marks)

Components of the CIA

CIA I   :  Subject Assignments / Online Tests                       : 10 marks

CIA II  :   Mid Semester Examination (Theory)                     : 25 marks                  

CIAIII:Quiz/Seminar/Case Studies/Project/Innovative Assignments/presentations/publications                                    : 10 marks

Attendance                                                                             : 05 marks

            Total                                                                                       : 50 marks

Mid Semester Examination (MSE) : Theory Papers:

• The MSE is conducted for 50 marks of 2 hours duration.
• Question paper pattern; Five out of Six questions have to be answered. Each  question carries 10 marks

End Semester Examination (ESE):

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers are divided into FIVE units and each unit carries equal Weightage in terms of marks distribution.

This course is designed to make the students familiar with basic techniques of algorithm analysis, to understand concepts of searching and sorting techniques and to assess how the choice of data structures impacts the performance of a program. 

Definition and basics of: Data Structure, ADT, Algorithms, Time and Space Complexity, Asymptotic Notations (O, θ, Ω), Time complexity computation of non-recursive algorithms (like Matrix addition, Selection sort – using step count), Array – basic operations, concept of multi-dimensional array, Polynomial operations using Array, Sparse Matrix

Stack ADT: basic operations, Queue ADT: basic operations, Circular Queue, Evaluation of Expressions, Another application or Mazing Problem

Singly Linked List: concept, representation and operations, Circular Linked List, Polynomial and Sparse Matrix operations using LL, Doubly Linked List: basic concept

Introduction, Notion of Algorithm, Fundamentals of Algorithmic Solving, Fundamentals of the Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non-recursive Algorithm, Mathematical Analysis of Recursive Algorithm and examples, Empirical Analysis of Algorithms and Algorithm Visualization

Brute Force and Exhaustive Search: Selection Sort, Bubble Sort, Sequential Search and Brute-force string matching, Travelling Salesman Problem, Knapsack Problem, Assignment Problem, DFS and BFS. Decrease and Conquer: Insertion Sort and Topological Sorting and Binary Search, Warshall’s and Floyd’s Algorithm. Greedy Techniques: Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm and Huffman trees

T2. Anany Levitin, “Introduction to the Design and Analysis of Algorithm”, 3/e, Pearson Education Asia, 2008, (Reprint 2012).

T3. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures and Algorithms in Java”, 6/e, Wiley, 2014.

R2Tanenbaum, Langsam, Augenstein, Data Structures using C, Pearson

R3. T. H Cormen, C E Leiserson, R L Rivest and C Stein: “Introduction to Algorithms”, 3rd Edition, The MIT Press, 2014.

R4.Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms, Second Edition, Universities Press, 2007.

·        

          Minimum marks required to pass in practical component is 40%.

·         Pass in practical component is eligibility criteria to attend Theory End semester examination for the same course.

·         A minimum of 40 % required to pass in ESE -Theory component of a course.

·         Overall 40 % aggregate marks in Theory & practical component, is required to pass a course.

·         There is no minimum pass marks for the Theory - CIA component.

·         Less than 40% in practical component is refereed as FAIL.

·         Less than 40% in Theory ESE is declared as fail in the theory component.

·         Students who failed in theory ESE have to attend only theory ESE to pass in the course

The aim of this course is to study the basics of digital circuits and learn methods and fundamental concepts used in the design of digital systems.

Design procedure – Four variable Karnaugh Maps, Adders-Subtractors – Serial adder/Subtractor - Parallel adder/ Subtractor- Carry look ahead adder- BCD adder, Magnitude Comparator. Multiplexer/ Demultiplexer,Encoder / decoder, parity checker, Code converters. Implementation of combinational logic using MUX, ROM, PAL and PLA

Classification of sequential circuits, Moore and Mealy -Design of Synchronous counters: state diagram- State table –State minimization –State assignment- ASM-Excitation table and maps-Circuit implementation - Universal shift register – Shift counters – Ring counters

Design of fundamental mode and pulse mode circuits – primitive state / flow table – Minimization of primitive state table –state assignment – Excitation table – Excitation map- cycles – Races, Hazards: Static –Dynamic –Essential –Hazards elimination.

Introduction – Special Characteristics – Bipolar Transistor Characteristics – RTL and DTL circuits – Transistor-Transistor Logic (TTL) Emitter Coupled Logic (ECL) – Metal Oxide Semiconductor (MOS) – Complementary MOS (CMOS) – CMOS Transmission Gate circuits

Basic Concepts: VLSI Design flow, identifiers, gate primitives, value set, ports, gate delays, structural gate level modeling, Behavioral modeling, Data flow modeling, Design hierarchies, Structural gate level description of combinational and sequential circuits.

T1. M. Morris Mano, Michael D. Ciletti, “Digital Design” 5^thEdition, Prentice Hall of India Pvt. Ltd., New Delhi, 2015/Pearson Education (Singapore) Pvt. Ltd., New Delhi, 2003.

T2. Samir Palnitkar, “Verilog HDL”, 2 edition, Pearson Education, 2003

T3. Peter.J.Ashenden, “Digital Design: An Embedded Systems Approach Using Verilog”, Elsevier 2010

R1. John .M Yarbrough,” Digital Logic Applications and Design”, Thomson- Vikas Publishing house, New Delhi, 2006.

R2. S. Salivahanan and S. Arivazhagan, “Digital Circuits and Design”, 5th ed., Vikas Publishing House Pvt. Ltd, New Delhi, 2016.

R3. Charles H.Roth, ” Fundamentals of Logic Design”, Thomson Publication Company, 2012.

R4. Donald P.Leach and Albert Paul Malvino, “Digital Principles and Applications”,6th Edition, Tata McGraw Hill Publishing Company Limited, New Delhi, 2012.

CIA will be conducted for 50 marks. Later the marks will be scaled down to 30 marks.

Components of the CIA:
CIA I : Subject Assignments / Online Tests : 10 marks
CIA II : Mid Semester Examination (Theory) : 25 marks
CIAIII:Quiz/Seminar/Case Studies/Project/Innovative Assignments/presentations
/publications : 10 marks
Attendance : 05 marks
Total : 50 marks
Mid Semester Examination (MSE) : Theory Papers:
The MSE is conducted for 50 marks of 2 hours duration.
Question paper pattern; Five out of Six questions have to be answered. Each question carries 10
marks

Theory ESE - 30 marks

End Semester Examination (ESE):
The ESE is conducted for 100 marks of 3 hours duration. (100 marks will be scaled down to 30 marks)

Practical - 35 marks

Practical assessment depends on the student's lab discipline, regular attendance, conduction of the lab, observation and record submission and final lab exam.

Attendance - 5 marks

In total, the course is evaluated for 100 (30+30+35+5) marks.

This course aims to explore modern programming languages and the techniques used for programming  in order to get idea on evaluation of programming languages and also helps students to analyze a given program from good programming practice perspective

The art of Language design – Programming language spectrum - Compilation and Interpretation – Evaluation of Programming languages – Syntax and Semantics of Language C-lite - Names – Types – Type Systems - Binding – Scope – Static – Dynamic – Abstract Data types

Expression – Assignment - Control Flow – Input/Output – Exception Handling – State Transformation – Partial Functions – Semantics with Dynamic Typing – Formal Treatment of Semantics

Call and Return – Parameter Passing – Function Declaration – Semantics Of Call and Return – Formal Treatment of Types and Semantics – Memory Management – Dynamic Arrays – Garbage Collection.

Imperative programming – C – ADA – Perl – Object Oriented Programming – Small TalkJava– Python – Functional Programming – Scheme – Haskell

Logic Programming – Prolog – Event-Driven programming – Concurrent Programming – Concepts – Synchronization Strategies – Language Level Mechanism - Interprocess COMMUNICATION – Scripting LANGUAGES

R2. Michael L Scott, ―Programming Language Pragmatics‖, Third Edition, Morgan Kauffman, 2009

(a) To understand the moral values that ought to guide the Engineering profession.

(b) To resolve the moral issues in the profession.

Introduction to Profession, Engineering and Professionalism, Three types of Ethics / Morality , Positive and Negative faces of Engineering Ethics

Introduction, Engineering Standards, Blame – Responsibility and Causation, Liability, Design Standards.

Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.

Technology – The Promise and Perils, Computer Technology – Privacy and Social Policy, Ownership of Computer Software and public Policy, Engineering Responsibility in Democratic Deliberation on Technology Policy, The Social Embeddedness of Technology.

Ethics in Electronics Engineering - IEEE Code of Ethics, Computer Ethics, Case Studies on ethical conflicts, Corporate Social Responsibility

Ethics in Electronics Business – HR, Marketing, Finance and Accounting, Production and Operation, Tendering and contracts, Ethical behaviour expected out of a electronic contractor

Environment in Law and Court Decisions, Criteria for “Clean Environment”, E-Waste Management, ethical responsibility towards e-waste management, radiation effects on the society, ethical behaviour of the stakeholders running the communication business 

T2.  Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.

R2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)

R3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003

R4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.

Understanding and application of MATLAB and TINKERCAD for biological analysis which would results in better healthcare and any engineer, irrespective of the parent discipline (mechanical, electrical, civil, computer, electronics, etc.,) can use the disciplinary skills toward designing/improving biological systems. This course is designed to convey the essentials of human physiology.The course will introduce to the students the various fundamental concepts in MATLAB and TINKERCAD for numerical analysis and circuit design using arduino.

To discuss the basic structure of a digital computer and to study in detail the organization of the Control unit, the Arithmetic and Logical unit, Memory unit and Intel Processors.

A Brief History of computers, Von Neumann Architecture, Harvard architecture, Computer Components, Functional units - Basic operational concepts - Bus structures - Software performance – Memory locations and addresses-Addition and subtraction of signed numbers – Design of fast adders – Multiplication of positive numbers - Hardware Implementation- Signed operand multiplication.

Booths Algorithm- fast multiplication – Integer division & it’s Hardware Implementation – Restoring and Non Restoring algorithms-Fundamental concepts – Execution of a complete instruction – Multiple bus organization – Hardwired control – Micro-programmed control - Pipelining – Basic concepts – Data hazards – operand forwarding-Instruction hazards- Instruction Set architecture for logical operation

Intel 8086 Microprocessor - Internal architecture – segment registers- 8086 memory organization–Flag Register-logical and physical address calculation-Block diagram of Minimum and maximum mode  and its operations – Interrupt and Interrupt applications-Assembly language programming of 8086.

Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – Timer –Interrupt controller – DMA controller – Programming and applications

Advanced Intel Microprocessors- Reduced Instruction cycle – five stage instruction pipe line – Integrated coprocessor – On board cache – Burst Bus mode. Pentium – super scalar architecture – u-v pipe line – branch prediction logic – cache structure – BIST (built in self-test) – Introduction to MMX technology. Case Study

T2. Douglous V. Hall “Microprocessor and Interfacing”  3^rd edition ,Tata McGraw Hill,2015.

T3.James L. Antonakos , “ The Pentium Microprocessor ‘’ Pearson Education, 2007

R2. David A.Patterson and John L.Hennessy, “Computer Organization and Design: The hardware / software interface”, 3rd Edition, Morgan Kaufmann, 2008

R3. John P.Hayes, “Computer Architecture and Organization”, 4^th  Edition, McGrawHill, 2003.

· End Semester Examination(ESE)      : 50% (50 marks out of 100 marks)

Components of the CIA

CIA I   :  Subject Assignments / Online Tests                      : 10 marks

CIA II  :   Mid Semester Examination (Theory)                    : 25 marks                 

CIA III            : Quiz/Seminar/Case Studies/Project/Innovative Assignments/presentations/publications       : 10 marks

Attendance                                                                             : 05 marks

 Total                                                                                       : 50 marks

Mid Semester Examination (MSE) : Theory Papers:

The MSE is conducted for 50 marks of 2 hours duration.

Question paper pattern; Five out of Six questions have to be answered. Each  question carries 10 marks

End Semester Examination (ESE):

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers are divided into FIVE units and each unit carries equal weightage in terms of marks distribution.

This course aims to introduce the concepts, terminologies, and technologies used in modern data communication and computer networking. It also gives an introduction to the IEEE standards used for WLAN for physical ant MAC layer.

Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences. TCP/IP.

Error – detection and correction – Parity – LRC – CRC – Hamming code – Flow Control and Error control: stop and wait – go back N ARQ – selective repeat ARQ- sliding window techniques – HDLC. LAN: Ethernet IEEE 802.3, IEEE 802.4, and IEEE 802.11

Internetworks - Packet Switching and Datagram approach – IP addressing methods IP Multicasting and broadcasting– Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers.

Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Service

IEEE 802.11––  Architecture, Types of stations, 802.11 MAC- DCF, PCF, Hidden Node Problem, RTS,CTS, 802.11 Frame Format, Adhoc Routing Protocols – Proactive Routing, OLSR, Reactive Routing, AODV, Multipath Routing.

R2. Larry L.Peterson & Peter S. Davie, “COMPUTER NETWORKS”, Harcourt Asia Pvt. Ltd., 5^th  Edition,2011

R3. Andrew S. Tannenbaum, “Computer Networks”, PHI, 5^th  Edition, 2016

R4. William Stallings, “Data and Computer Communication”, 8^th  Edition, Pearson Education, 2013

R5. Azzedine Boukerche “Algorithms and Protocols for Wireless, Mobile AdHoc Networks”, Wiley-IEEE Press, 2008

The students should be able to understand a broad overview of the essential concepts of blockchain technology.

Course Objectives: 

1. Understanding the concepts and the various terminologies in blockchain. 
2. Familiarizing the various types of algorithms used in distributed computing.
3. Understanding the workings of blockchain and the mining process.
4.  Analyzing the various applications of blockchain technologies.
5. Analyzing the security and privacy issues in the blockchain.

Distributed DBMS – Limitations of Distributed DBMS, Introduction to Block chain – History, Definition, Distributed Ledger, Blockchain Categories – Public, Private, Consortium, Blockchain Network and Nodes, Peer-to-Peer Network, Mining Mechanism, Generic elements of Blockchain, Features of Blockchain, and Types of Blockchain

Atomic Broadcast, Consensus, Byzantine Models of Fault tolerance Hash functions, Puzzle friendly Hash, Collison resistant hash, digital signatures, public key crypto, verifiable random functions, Zero-knowledge systems.

Operation of Bitcoin Blockchain, Blockchain Architecture – Block, Hash, Distributer P2P, Structure of Blockchain- Consensus mechanism: Proof of Work (PoW), Proof of Stake (PoS), Byzantine Fault Tolerance (BFT), Proof of Authority (PoA) and Proof of Elapsed Time (PoET)

Ethereum and Smart Contracts, The Turing Completeness of Smart Contract Languages and verification challenges, Using smart contracts to enforce legal contracts, comparing Bitcoin scripting vs. Ethereum Smart Contracts

 Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS for anonymity preservation, attacks on Blockchains – such as Sybil attacks, selfish mining, 51% attacks - -advent of algorand, and Sharding based consensus algorithms to prevent these

This course presents the concept of object oriented programming and also introduces the concept in C++ . The students will be familiarized with concepts like data abstraction, polymorphism and inheritance.  

Approaches to Software Design - Functional Oriented Design, Object Oriented Design, Case Study of Automated Fire Alarm System. Object Modeling Using Unified Modeling Language (UML) – Basic Object Oriented concepts, UML diagrams, Use case model, Class diagram, Interaction diagram, Activity diagram, State chart diagram. Introduction to Java - Java programming Environment and Runtime Environment, Development Platforms -Standard, Enterprise. Java Virtual Machine (JVM), Java compiler, Bytecode, Java applet, Java Buzzwords, Java program structure, Comments, Garbage Collection, Lexical Issues

Primitive Data types - Integers, Floating Point Types, Characters, Boolean. Literals, Type Conversion and Casting, Variables, Arrays, Strings, Vector class. Operators - Arithmetic Operators, Bitwise Operators, Relational Operators, Boolean Logical Operators, Assignment Operator, Conditional (Ternary) Operator, Operator Precedence. Control Statements - Selection Statements, Iteration Statements and Jump Statements. Object Oriented Programming in Java - Class Fundamentals, Declaring Objects, Object Reference, Introduction to Methods, Constructors, this Keyword, Method Overloading, Using Objects as Parameters, Returning Objects, Recursion, Access Control, Static Members, Final Variables, Inner Classes, Command Line Arguments, Variable Length Arguments. Inheritance - Super Class, Sub Class, The Keyword super, protected Members, Calling Order of Constructors, Method Overriding, the Object class, Abstract Classes and Methods, using final with Inheritance

Packages and Interfaces - Defining Package, CLASSPATH, Access Protection, Importing Packages, Interfaces. Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block and catch Clause, Multiple catch Clauses, Nested try Statements, throw, throws and finally. Input/Output - I/O Basics, Reading Console Input, Writing Console Output, PrintWriter Class, Object Streams and Serialization, Working with Files

Java Library - String Handling – String Constructors, String Length, Special String Operations - Character Extraction, String Comparison, Searching Strings, Modifying Strings, using valueOf(), Comparison of StringBuffer and String. Collections framework - Collections overview, Collections Interfaces- Collection Interface, List Interface. Collections Class – ArrayList class. Accessing a Collection via an Iterator. Event handling - Event Handling Mechanisms, Delegation Event Model, Event Classes, Sources of Events, Event Listener Interfaces, Using the Delegation Model. Multithreaded Programming - The Java Thread Model, The Main Thread, Creating Thread, Creating Multiple Threads, Synchronization, Suspending, Resuming and Stopping Threads

Swings fundamentals - Swing Key Features, Model View Controller (MVC), Swing Controls, Components and Containers, Swing Packages, Event Handling in Swings, Swing Layout Managers, Exploring Swings –JFrame, JLabel, The Swing Buttons, JTextField. Java DataBase Connectivity (JDBC) - JDBC overview, Creating and Executing Queries – create table, delete, insert, select

T2. Rajib Mall, Fundamentals of Software Engineering, 4th edition, PHI, 2014

T3. Paul Deitel, Harvey Deitel, Java How to Program, Early Objects 11th Edition, Pearson, 2018

R2. Nageswararao R., Core Java: An Integrated Approach, Dreamtech Press, 2008

R3. Flanagan D., Java in A Nutshell, 5/e, O'Reilly, 2005

R4. Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier, 2004

R5. Sierra K., Head First Java, 2/e, O'Reilly, 2005

R6. Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014

This course aims to introduce artificial intelligence by knowledge representation using semantic networks and rules, concepts of logic in artificial intelligence, concepts of planning and learning with an introduction of the expert systems.  

Introduction, History, Intelligent Systems, Foundations of AI, Sub areas of AI, Applications. Problem Solving – State-Space Search and Control Strategies: Introduction, General Problem Solving, Characteristics of Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative-Deepening A*, Constraint Satisfaction. Game Playing, Bounded Look-ahead Strategy and use of Evaluation Functions, Alpha-Beta Pruning. 

Logic Concepts and Logic Programming: Introduction, Propositional Calculus, Propositional Logic, Natural Deduction System, Axiomatic System, Semantic Tableau System in Propositional Logic, Resolution Refutation in Propositional Logic, Predicate Logic, Logic Programming. Knowledge Representation: Introduction, Approaches to Knowledge Representation, Knowledge Representation using Semantic Network, Extended Semantic Networks for KR, Representing Knowledge using rules – Rules based deduction system, Knowledge Representation using Frames

Introduction to uncertain knowledge review of probability – Baye’s Probabilistic inferences and Dempster Shafer theory –Heuristic methods – Symbolic reasoning under uncertainty- Statistical reasoning – Fuzzy reasoning – Temporal reasoning- Non monotonic reasoning.

Planning - Introduction, Planning in situational calculus - Representation for planning – Partial order planning algorithm- Learning from examples- Discovery as learning – Learning by analogy – Explanation based learning –Introduction to Neural nets – Genetic Algorithms

Expert Systems – Architecture Of Expert Systems, Roles Of Expert Systems – Knowledge Acquisition –Meta Knowledge, Heuristics. Typical Expert Systems – MYCIN, DART, XOON, Expert Systems Shells.

T2. Patrick Henry Winston,” Artificial Intelligence”, Addison Wesley, Third edition, 2010

T3. Kevin Night And Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, McGraw Hill- 2008

R2. Engene Charniak and Drew Mc Dermott,” Introduction to Artificial intelligence, Addison Wesley, 2009

R3. Nils J. Nilsson,”Principles of Artificial Intelligence“, Narosa Publishing House, 2000

This course provides the mathematical representation of signals and systems using various transforms such as laplace, fourier and z-transforms. The course is designed to make the students familiar with the signals and their variations so that the fundamental of electronics engineering is well placed out. 

Definition, types of signals and their representations: continuous-time/discrete-time, periodic/non-periodic, even/odd, energy/power, deterministic/ random, one dimensional/ multidimensional; commonly used signals (in continuous-time as well as in discrete-time): unit impulse, unit step, unit ramp (and their interrelationships), exponential, rectangular pulse, sinusoidal; operations on continuous-time and discrete-time signals (including transformations of independent variables)

One-sided LT of some common signals, important theorems and properties of LT, inverse LT, solutions of differential equations using LT, Bilateral LT, Regions of convergence (ROC

Definition, conditions of existence of FT, properties, magnitude and phase spectra, Some important FT theorems, Parseval’s theorem, Inverse FT, relation between LT and FT, Discrete time Fourier transform (DTFT), inverse DTFT, convergence, properties and theorems, Comparison between continuous time FT and DTFT.

Continuous Time Systems: Linear Time invariant Systems and their properties. Differential equation & Block diagram representation, Impulse response, Convolution integral, Frequency response (Transfer Function), Fourier transforms analysis. Discrete Time System: Difference equations, Block diagram representation, Impulse response, Convolution sum, MATLAB tutorials

Continuous Time Systems: Linear Time invariant Systems and their properties. Differential equation & Block diagram representation, Impulse response, Convolution integral, Frequency response (Transfer Function), Fourier transforms analysis. Discrete Time System: Difference equations, Block diagram representation, Impulse response, Convolution sum, MATLAB tutorials

T2. Signals, Systems & Communications - B.P. Lathi, BS Publications, 2003

R2. Principles of Linear Systems and Signals, BP Lathi, Oxford University Press, 2015

R3. Fundamentals of Signals and Systems- Michel J. Robert, MGH International Edition, 2008

·         End Semester Examination(ESE)      : 50% (50 marks out of 100 marks)

Components of the CIA

CIA I   :  Subject Assignments / Online Tests                      : 10 marks

CIA II  :   Mid Semester Examination (Theory)                    : 25 marks                  

CIA III            : Quiz/Seminar/Case Studies/Project/

              Innovative Assignments/presentations/publications       : 10 marks

Attendance                                                                             : 05 marks

            Total                                                                                       : 50 marks

Mid Semester Examination (MSE) : Theory Papers:

• The MSE is conducted for 50 marks of 2 hours duration.
• Question paper pattern; Five out of Six questions have to be answered. Each  question carries 10 marks

End Semester Examination (ESE):

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers are divided into FIVE units and each unit carries equal weightage in terms of marks distribution.

Question paper pattern is as follows.

Two full questions with either or choice will be drawn from each unit. Each question carries 20 marks. There could be a maximum of three sub divisions in a question. The emphasis on the questions is to test the objectiveness, analytical skill and application skill of the concept, from a question bank which reviewed and updated every year

The criteria for drawing the questions from the Question Bank are as follows

50 % - Medium Level questions

25 % - Simple level questions

25 % - Complex level questions

To understand the scope and importance of environmental science towards developing a conscious community for environmental issues, both at global and local scale.  

Environment and Eco systems – Definition, Scope and importance. Components of environment. Concept and Structure of eco systems. Material Cycles – Nitrogen, Carbon, Sulphur, Phosphorous, Oxygen. Energy Flow and classification of Eco systems.   

Classification and importance- Forest, Water, Mineral, Food, Energy. Management of natural resources – challenges and methods. Sustainable development – Goals, Agriculture, Industries

Causes and Impacts – Air pollution, Water pollution, Soil Pollution, Noise Pollution, Marine Pollution, Municipal Solid Wastes, Bio Medical and E-Waste. Solid Waste Management

Global Temperature, Greenhouse effect, global energy balance, Global warming potential, International Panel for Climate Change (IPCC) Emission scenarios, Oceans and climate change. Adaptation methods. Green Climate fund. Climate change related planning- small islands and coastal region. Impact on women, children, youths and marginalized communities

Technology, Modern Tools – GIS and  Remote Sensing,. Institutional Mechanisms - Environmental Acts and Regulations, Role of government, Legal aspects. Role of Nongovernmental Organizations (NGOs) , Environmental Education and Entrepreneurship

T2Asthana and Asthana, “A text Book of Environmental Studies”, S. Chand, New Delhi, Revised Edition, 2010 [Unit: I, II, III and V]

T3Nandini. N, Sunitha. N and Tandon. S, “environmental Studies” , Sapana, Bangalore,  June 2019 [Unit: I, II, III and IV]

T4R Rajagopalan, “Environmental Studies – From Crisis to Cure”, Oxford, Seventh University Press, 2017, [Unit: I, II, III and IV]

R2.Masters, G andEla, W.P (2015), Introduction to environmental Engineering and Science, 3rd Edition. Pearson., New Delhi, 2013.

R3.Raman Sivakumar, “Principals of Environmental Science and Engineering”, Second Edition, Cengage learning Singapore, 2005.

R4.P. Meenakshi, “Elements of Environmental Science and Engineering”, Prentice Hall of India Private Limited, New Delhi, 2006.

R5.S.M. Prakash, “Environmental Studies”, Elite Publishers Mangalore, 2007

R6.ErachBharucha, “Textbook of Environmental Studies”, for UGC, University press, 2005.

R7. Dr. Pratiba Sing, Dr. AnoopSingh and Dr. PiyushMalaviya, “Textbook of Environmental and Ecology”, Acme Learning Pvt. Ltd. New Delhi.

Specifically, the course has the following objectives. By the end of the course, students will be able to:

●       Develop a working knowledge for how computers operate and how computer programs are executed.

●       Evolve critical thinking and problem-solving skills using an algorithmic approach.

●       Learn about the programmer’s role in the software development process.

            Translate real-world issues into computer-solvable problems.

Introduction to Python and computer programming: Programming – absolute basics, Python – a tool, not a reptile, First program, Python literals, Operators – data manipulation tools, Variables

Making decisions in Python, Python's loops, Logic and bit operations in Python, Lists – collections of data, Sorting simple lists – the bubble sort algorithm, Lists – some more details, Lists in advanced applications

Writing functions in Python, How functions communicate with their environment, Returning a result from a function, Scopes in Python. Creating functions, Tuples and dictionaries

Using modules, Some useful modules, Package, Errors, The anatomy of an exception, Some of the most useful exceptions, Characters and strings vs. computers, The nature of Python's strings, String methods, Strings in action.

Basic concepts of object programming, A short journey from the procedural to the object approach, Properties, Methods, Inheritance – one of object programming foundations, Generators and closures, Processing files, Working with real files.

T2. Paul Barry, “Head first Python”, 2nd Edition, O’Reilly, 2017.

R2: Martin C. Brown,”Python: The Complete Reference”, McGraw Hill Education; Forth edition (20 March 2018)

ESE Marks : 50

Course objectives: 

•          To understand the need for machine learning

•          To discover supervised and unsupervised learning paradigms of machine learning

•          To learn various machine learning techniques

•          To design suitable machine learning algorithms for solving problems

Basic methods: Distance-based methods, Nearest-Neighbours, Decision Trees, Naive Bayes.         Linear models: Linear Regression, Logistic Regression, Generalized Linear Models.Support Vector Machines.

Clustering: K-means/Kernel K-means,Dimensionality Reduction: PCA and kernel PCA,         Matrix Factorization and Matrix Completion.

Neural Network Representation – Problems – Perceptrons – Multilayer Networks and Back Propagation Algorithms – Advanced Topics.

Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum Description Length Principle – Bayes Optimal Classifier – Gibbs Algorithm – Naïve Bayes Classifier – Bayesian Belief Network – EM Algorithm.

K- Nearest Neighbour Learning – Locally weighted Regression – Radial Basis Functions – Case Based Learning- Learning from perfect domain theories-Explanation based learning-Search control knowledge.

Text Books:

T1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012

T2. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.

Reference Books:

R1. EthemAlpaydin, ―Introduction to Machine Learning (Adaptive Computation and machine Learning), The MIT Press 2004.

R2.Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.

R3.T. Hastie, R. Tibshirani, J. H. Friedman, “The Elements of Statistical Learning”, Springer; 1st edition, 2001.

R4. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning, Springer 2009 (freely available online)

R5.Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007.

Assessment of each paper

·         Continuous Internal Assessment (CIA) for Theory papers: 50% (50 marks out of 100 marks)

·         End Semester Examination(ESE) : 50% (50 marks out of 100 marks)

Components of the CIA

 CIA I  :  Quizzes/Seminar/Case Studies/Project Work /Assignments     : 10 marks

 CIA II  :   Mid Semester Examination (Theory)                                                : 25 marks

 CIA III  : Quizzes/Seminar/Case Studies/Project Work /Assignments             : 10 mark

Attendance                                                                                                          : 05 marks

Total                                                                                                                    : 50 marks

• Analyze and Compute FFT of a discrete time signal.
• Design the various FIR filter techniques.
• Design the various IIR filter techniques.
• Analyze the finite word length effects in signal processing.
• Learn the fundamentals of digital signal processors.

Introduction to DFT – Efficient computation of DFT- Properties of DFT – FFT algorithms – Radix-2 FFT algorithms – Decimation in Time – Decimation in Frequency algorithms –sectioned convolution- overlap add method- overlap save method.

Linear phase filters-Frequency response of linear phase FIR filters-Fourier series method of designing FIR filters-Windowing techniques for design of linear phase FIR filters:Rectangular- Hamming- Hanning-Blackman windows - Gibbs phenomenon –principle of frequency sampling technique- FIR Filter Realization-Direct form,Cascade ,Linear phase FIR realization.

Review of design of analogue Butterworth and Chebyshev Filters- Design of IIR digital filters using impulse invariance technique –bilinear transformation – pre warping –Frequency transformation in digital domain – IIR Filter Realization - Direct form I, Direct form II, cascade and parallel.

Binary fixed point and floating point number representations - Comparison- Quantization noise – truncation and rounding-derivation for quantization noise power – input quantization error-coefficient quantization error –limit cycle oscillations-dead band problems - Overflow error-signal scaling.

Introduction to DSP Architecture – Dedicated MAC unit - Features of C6X Processor - Internal Architecture - Functional Units and Operation - Addressing Modes

T2. S. K. Mitra- “Digital Signal Processing- A Computer based approach”, TataMc-Graw-Hill, 2001, New Delhi.

T3. B. Venkataramani & M.Bhaskar, Digital Signal Processor Architecture-Programming and Application, Tata Mc-GrawHill 2002

R2. Johny R-Johnson: Introduction to Digital Signal Processing, Prentice-Hall- 1984

R3. Emmanuel I Fetchor “Digital Signal Processing: A Practical Approach”, 2/E -Prentice Hall

R4. Li Tan “ Digital Signal Processing” Elsevier-2008

R5. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2006

This course aims atlearning the architecture programming and interfacing of  Microcontrollers (ARM and 8051)

Architecture – Program memory organization – Data memory organization- Internal RAM-SFR-Flag Register- Timers/Counters & its operation registers –Interrupts of 8051 - I/O ports and its structures  Interfacing I/O Devices – External memory interfacing-8051 addressing modes.

Instruction set –Data Transfer Instructions - Arithmetic Instructions – Logical Instructions –Control transfer-Bit Manipulation Instructions – Timer/ Counter Programming – Serial Communication Programming- Interrupt Programming & its structure  – I/O port Programming Assembly language programming, Introduction to Embedded C.

Interfacing LCD Display –  Matrix Keypad Interfacing – ADC Interfacing –DAC Interfacing –Sensor Interfacing –Interfacing with 8255 Controlling AC appliances – Stepper Motor Control – DC Motor Interfacing.

The ARM architecture– Bus Architecture-ARM organization and implementation – Addressing Modes-The ARM instruction set - The thumb instruction set– ARM assembly language program

Processors and hardware units in an embedded system-Embedded Systems on a Chip (SoC) –Serial Communication Devices -Parallel Port Devices-Advanced I/O Serial high speed buses-Interrupt Routines Handling in RTOS- RTOS Task scheduling models-Inter process communication and synchronisation -Case Study.

T2. Muhammad Ali Mazidi, Rolin D. Mckinlay, Danny Causey ‘ 8051 Microcontroller and Embedded Systems using Assembly and C ’ ,2^nd edition, Prentice Hall of India,2008

R2. Steve Furber , ‘’ ARM System On –Chip architecture “Addision Wesley , 2^nd edition,2000.

Identify, formulate, research literature, and analyse complex engineering

problems reaching substantiated conclusions using first principles of mathematics, natural

sciences, and engineering sciences.

Divisibility and the divisibility algorithm, Euclidean algorithm, Modular arithmetic, Groups, Rings and Fields, Finite fields of the form GF(p), Polynomial arithmetic, Finite fields of the form GF(2n), Galois group of a field extensions, Fixed field and Galois extensions, Fundamental theorem of Galois Theory

Symmetric cipher model, Substitution techniques, Transposition techniques, Steganography, Traditional Block Cipher structure, Data Encryption Standard (DES) 

The AES Cipher, Linear Congruential Generators, Linear Feedback Shift Registers, Design and analysis of stream ciphers, Stream ciphers using LFSRs 

ESE-50

The students should be able to understand a broad overview of the essential concepts of blockchain technology. Students should be able to learn about different types of blockchain algorithms.

Distributed DBMS – Limitations of Distributed DBMS, Introduction to Block chain – History, Definition, Distributed Ledger, Blockchain Categories – Public, Private, Consortium, Blockchain Network and Nodes, Peer-to-Peer Network, Mining Mechanism, Generic elements of Blockchain, Features of Blockchain, and Types of Blockchain. 

Atomic Broadcast, Consensus, Byzantine Models of fault tolerance Hash functions, Puzzle friendly Hash, Collison resistant hash, digital signatures, public key crypto, verifiable random functions, Zero-knowledge systems

Operation of Bitcoin Blockchain, Blockchain Architecture – Block, Hash, Distributer P2P, Structure of Blockchain- Consensus mechanism: Proof of Work (PoW), Proof of Stake (PoS), Byzantine Fault Tolerance (BFT), Proof of Authority (PoA) and Proof of Elapsed Time (PoET)

Ethereum and Smart Contracts, The Turing Completeness of Smart Contract Languages and verification challenges, Using smart contracts to enforce legal contracts, comparing Bitcoin scripting vs. Ethereum Smart Contracts

Pseudo-anonymity vs. anonymity, Zcash and Zk-SNARKS for anonymity preservation, attacks on Blockchains – such as Sybil attacks, selfish mining, 51% attacks - -advent of algorand, and Sharding based consensus algorithms to prevent these 

2. Bellaj Badr, Richard Horrocks, Xun (Brian) Wu, “Blockchain By Example: A developer's guide to creating decentralized applications using Bitcoin, Ethereum, and Hyperledger”, Packt Publishing Limited, 2018.

2.Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven Goldfeder, “Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction”, Princeton University Press, 2016.

This course introduces the fundamental concepts, principles, analysis and design of hybrid and electric vehicles.

·         To recognize the application of various drive components and selection of proper component for particular applications.

History and importance of hybrid and electric vehicles, impact of modern drive-trains on energy supplies. Basics of vehicle performance, vehicle power sources, transmission characteristics, and mathematical models to describe vehicle performance.

Basic concept of hybrid traction, introduction to various hybrid drive-train topologies, power flow control in hybrid drive-train topologies, fuel efficiency analysis. Basic concepts of electric traction, introduction to various electric drive-train topologies, power flow control in hybrid drive-train topologies, fuel efficiency analysis.

Introduction to electric components used in hybrid and electric vehicles, configuration and control of DC Motor drives, Configuration and control of Induction Motor drives, configuration and control of Permanent Magnet Motor drives, Configuration and control of Switch Reluctance Motor drives, drive system efficiency.

Matching the electric machine and the internal combustion engine (ICE), Sizing the propulsion motor, sizing the power electronics, selecting the energy storage technology, Communications, supporting subsystems

Introduction to energy management strategies used in hybrid and electric vehicle, classification of different energy management strategies, comparison of different energy management strategies, implementation issues of energy strategies.

2.      IqbalHussain, ‘Electric and Hybrid Vehicles: Design Fundamentals’, 2^nd edition, CRC Pr I Llc, 2010

2.      Siew-Chong Tan, Yuk-Ming Lai, Chi Kong Tse, ‘Sliding mode control of switching Power Converters’, CRC Press, 2011

3.      Ion Boldea and S.A Nasar, ‘Electric drives’, CRC Press, 2005

CIA II -midsem 50 marks

CIA III - 20 marks

ESE - 100 marks

·         To understand concepts in kinematics and dynamics of robotic system.

·         To introduce control strategies of simple robotic system.

·         To study the applications of computer based control to integrated automation systems.

Robot definitions - Laws of robotics - Robot anatomy - History - Human systems and Robotics - Specifications of Robots - Flexible automation versus Robotic technology - Classification applications

Basic structure of a robot – Robot end effectors - Manipulators - Classification of robots – Accuracy - Resolution and repeatability of a robot - Drives and control systems – Mechanical components of robots – Sensors and vision systems - Transducers and sensors - Tactile sensors – Proximity sensors and range sensors - Vision systems - RTOS - PLCs - Power electronics

Matrix representation - Forward and reverse kinematics of three degree of freedom – Robot Arm – Homogeneous transformations – Inverse kinematics of Robot – Robo Arm dynamics - D-H representation of forward kinematic equations of robots - Trajectory planning and avoidance of obstacles - Path planning - Skew motion - Joint integrated motion – Straight line motion - Robot languages- Computer control and Robot programming/software

Open loop and feedback control - General approach to control system design - Symbols and drawings - Schematic layout - Travel step diagram, circuit and control modes - Program control - Sequence control - Cascade method - Karnaugh-Veitch mapping - Microcontrollers - Neural network - Artificial Intelligence - Adaptive Control – Hybrid control

Material handling - Machine loading, Assembly, inspection, processing operations and service robots - Mobile Robots - Robot cell layouts - Robot programming languages

2.      Spong and Vidhyasagar, “Robot Dynamics and Control”, John Wiley and sons, 2008.

3.      S. R. Deb and S. Deb, ‘Robotics Technology and Flexible Automation’, Tata McGraw Hill Education Pvt. Ltd, 2010.

2.      Mikell P. Grooveret. al., "Industrial Robots - Technology, Programming and Applications",     McGraw Hill, New York, 2008.

CIA II - midsem 50 marks

CIA III - 20 marks

ESE - 100 marks

Introducing the concepts of various components of Smart Grid, and their impacts on the energy industry, including renewable integration, PHEV penetration, demand side management, and greenhouse gas (GHG) emissions reductions. Energy policy modelling and analysis, such as policies on GHG emissions reductions and incentives to green energy investments, will be integrated into the course as well.

Evolution of Electric Grid, Concept of Smart Grid, Definitions, Need of Smart Grid, Functions of Smart Grid, Opportunities & Barriers of Smart Grid, Difference between conventional & smart grid, Concept of Resilient &Self Healing Grid, Present development & International policies in Smart Grid. Case study of Smart Grid.CDM opportunities in Smart Grid.

Introduction to Smart Meters, Real Time Prizing, Smart Appliances, Automatic Meter Reading(AMR), Outage Management System(OMS), Plug in Hybrid Electric Vehicles(PHEV), Vehicle to Grid, Smart Sensors, Home & Building Automation, Phase Shifting Transformers.

Smart Substations, Substation Automation, Feeder Automation. Geographic Information System(GIS), Intelligent Electronic Devices(IED) & their application for monitoring &protection, Smart storage like Battery, SMES, Pumped Hydro, Compressed Air Energy Storage, Wide Area Measurement System(WAMS), Phase Measurement Unit (PMU).

Advanced Metering Infrastructure (AMI), Home Area Network (HAN), Neighborhood Area Network (NAN), Wide Area Network (WAN). Bluetooth, ZigBee, GPS, Wi-Fi, Wi-Max based communication, Wireless Mesh Network, Basics of CLOUD Computing & Cyber Security for Smart Grid. Broadband over Power line (BPL). IP based protocols.

Power Quality & EMC in Smart Grid, Power Quality issues of Grid connected Renewable Energy Sources, Power Quality Conditioners for Smart Grid, Web based Power Quality monitoring, Power Quality Audit.

2. Clark W. Gellings, “The Smart Grid: Enabling Energy Efficiency and Demand Response”,CRC Press

3. JanakaEkanayake, Nick Jenkins, KithsiriLiyanage, Jianzhong Wu, Akihiko Yokoyama,“Smart Grid: Technology and Applications”, Wiley

4. Jean Claude Sabonnadière, NouredineHadjsaïd, “Smart Grids”, Wiley Blackwell

5. Peter S. Fox Penner, “Smart Power: Climate Changes, the Smart Grid, and the Future ofElectric Utilities”, Island Press; 1 edition 8 Jun 2010

6. S. Chowdhury, S. P. Chowdhury, P. Crossley, “Microgrids and Active DistributionNetworks.” Institution of Engineering and Technology, 30 Jun 2009

7. Stuart Borlase, “Smart Grids (Power Engineering)”, CRC Press

2. James Northcote, Green, Robert G. Wilson “Control and Automation of Electric PowerDistribution Systems (Power Engineering)”, CRC Press

3. MladenKezunovic, Mark G. Adamiak, Alexander P. Apostolov, Jeffrey George Gilbert“Substation Automation (Power Electronics and Power Systems)”, Springer

4. R. C. Dugan, Mark F. McGranghan, Surya Santoso, H. Wayne Beaty, “Electrical PowerSystem Quality”, 2nd Edition, McGraw Hill Publication

5. Yang Xiao, “Communication and Networking in Smart Grids”, CRC Press.

End Semester Examination(ESE)          : 50% (50 marks out of 100 marks)

Components of the CIA

CIA I  :  Subject Assignments / Online Tests             : 10 marks

CIA II:   Mid Semester Examination (Theory)                      : 25 marks                   

CIAIII: Quiz/Seminar/Case Studies/Project/

Innovative assignments/ presentations/ publications              : 10 marks

Attendance                                                                             : 05 marks

            Total                                                                            : 50 marks

Mid Semester Examination (MSE): Theory Papers:

The MSE is conducted for 50 marks of 2 hours duration.

Question paper pattern; Five out of Six questions have to be answered. Each question carries 10 marks

End Semester Examination (ESE):

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers are divided into FIVE units and each unit carries equal Weightage in terms of marks distribution.

Question paper pattern is as follows.

Two full questions with either or choice will be drawn from each unit. Each question carries 20 marks. There could be a maximum of three sub divisions in a question. The emphasis on the questions is to test the objectiveness, analytical skill and application skill of the concept, from a question bank which reviewed and updated every year

The criteria for drawing the questions from the Question Bank are as follows

50 % - Medium Level questions

25 % - Simple level questions

25 % - Complex level questions

This course is provides the fundamentals of data models and to conceptualize and depict a  system using ER diagram. To make a study of SQL and relational database design. To understand the internal storage structures using different file and indexing techniques which will help in physical DB design. To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure. To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML. To implement the design of the tables in DBMS. To write queries to get optimized outputs. To store, retrieve and view the contents. To generate report based on customized need. 

Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.

SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).

Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+ Tree – Query Processing.

Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging

Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations- Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.

R2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.

The Objectives of this course is to have an overview of different types of operating systems. They also include an understanding of the components of an operating system; To develop knowledge of process management and have a thorough knowledge of storage management; To know the concepts of I/O and file systems.

File System Interface: File System: File Concept, Access Methods, Directory Structure, File System Mounting, File Sharing, Protection;

File System Implementation & Mass Storage Structure: Implementing File Systems: File System Structure, File System Implementation, Directory Implementation, Allocation Methods, Free Space Management. Disk structure, Disk Attachment, Disk Scheduling Methods, Disk Management, Swap-Space Management